package leetcode.code0094;

import java.util.List;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;
import leetcode.helper.tree.TreeArray;
import leetcode.helper.tree.TreeNode;

public abstract class Solution94 implements IDebug {
	public abstract List<Integer> inorderTraversal(TreeNode root);

	@Override
	public void debug1() {
		String str1 = "[1,null,2,3]";
		TreeNode root = TreeArray.array2tree(HelpDebug.str2array4(str1));
		List<Integer> r = this.inorderTraversal(root);
		String str2 = "[1,3,2]";
		List<Integer> e = HelpDebug.str2intlist(str2);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
